Elementary moves on lattice polytopes
نویسندگان
چکیده
منابع مشابه
Elementary Moves on Triangulations
It is proved that a triangulation of a polyhedron can always be transformed into any other triangulation of the polyhedron using only elementary moves. One consequence is that an additive function (valuation) defined only on simplices may always be extended to an additive function on all polyhedra. 2000 AMS subject classification: 52B45; 52A38; 57Q15;
متن کاملOn Lattice-Free Orbit Polytopes
Given a permutation group acting on coordinates of R, we consider lattice-free polytopes that are the convex hull of an orbit of one integral vector. The vertices of such polytopes are called core points and they play a key role in a recent approach to exploit symmetry in integer convex optimization problems. Here, naturally the question arises, for which groups the number of core points is Vni...
متن کاملMinkowski valuations on lattice polytopes
A complete classification is established of Minkowski valuations on lattice polytopes that intertwine the special linear group over the integers and are translation invariant. In the contravariant case, the only such valuations are multiples of projection bodies. In the equivariant case, the only such valuations are generalized difference bodies combined with multiples of the newly defined disc...
متن کاملTensor valuations on lattice polytopes
The Ehrhart polynomial and the reciprocity theorems by Ehrhart & Macdonald are extended to tensor valuations on lattice polytopes. A complete classification is established of tensor valuations of rank up to eight that are equivariant with respect to the special linear group over the integers and translation covariant. Every such valuation is a linear combination of the Ehrhart tensors which is ...
متن کاملLattice Points inside Lattice Polytopes
We show that, for any lattice polytope P ⊂ R, the set int(P ) ∩ lZ (provided it is non-empty) contains a point whose coefficient of asymmetry with respect to P is at most 8d · (8l+7) 2d+1 . If, moreover, P is a simplex, then this bound can be improved to 9 · (8l+ 7) d+1 . This implies that the maximum volume of a lattice polytope P ⊂ R d containing exactly k ≥ 1 points of lZ in its interior, is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2020
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2019.105200